522 research outputs found
A formulation of a (q+1,8)-cage
Let be a prime power. In this note we present a formulation for
obtaining the known -cages which has allowed us to construct small
--graphs for and . Furthermore, we also obtain smaller
-graphs for even prime power .Comment: 14 pages, 2 figure
A construction of small (q-1)-regular graphs of girth 8
In this note we construct a new infinite family of -regular graphs of
girth and order for all prime powers , which are the
smallest known so far whenever is not a prime power or a prime power plus
one itself.Comment: 8 pages, 2 figure
A new bound for the connectivity of cages
AbstractAn (r,g)-cage is an r-regular graph of girth g of minimum order. We prove that all (r,g)-cages are at least ⌈r/2⌉-connected for every odd girth g≥7 by means of a matrix technique which allows us to construct graphs without short cycles. This lower bound on the vertex connectivity of cages is a new advance in proving the conjecture of Fu, Huang and Rodger which states that all (r,g)-cages are r-connected
On the Minimum Order of Extremal Graphs to have a Prescribed Girth
We show that any n‐vertex extremal graph G without cycles of length at most k has girth exactly if and . This result provides an improvement of the asymptotical known result by Lazebnik and Wang [J. Graph Theory, 26 (1997), pp. 147–153] who proved that the girth is exactly if and , where . Moreover, we prove that the girth of G is at most if , where . In general, for we show that the girth of G is at most if
An explicit formula for obtaining -cages and others small regular graphs of girth 8
Let be a prime power; -cages have been constructed as incidence
graphs of a non-degenerate quadric surface in projective 4-space . The
first contribution of this paper is a construction of these graphs in an
alternative way by means of an explicit formula using graphical terminology.
Furthermore by removing some specific perfect dominating sets from a
-cage we derive -regular graphs of girth 8 for and ,
having the smallest number of vertices known so far
Families of Small Regular Graphs of Girth 5
In this paper we obtain --regular graphs of girth 5 with fewer
vertices than previously known ones for and for any prime performing operations of reductions and amalgams on the Levi graph of
an elliptic semiplane of type . We also obtain a 13-regular graph of
girth 5 on 236 vertices from using the same technique
Soybean as supplement of growing cattle on tropical pasture: effects on intake, digestibility and animal performance
An indoor trial was conducted with weaning heifers (experiment 1). Raw whole soybean (RSB), whole soybean heated with steam (SHSB) and extruded whole soybean (EXSB) were given as supplements at 0.7% of live weight (LW). One group was the control, with no supplement. All supplements increased total dry matter (DM) intake and did not affect hay intake. RSB was the most degradable crude protein (CP) source. Total digestive tract digestibility was not affected by treatments, except for apparent CP digestibility. Because total DM intake increased in supplemented animals, all supplements increased intake of digestible DM, organic matter (OM) and CP over the control. In another assay (experiment 2) a performance trial was conducted with forty weaned heifers. The same supplements used in experiment 1 were used. Heifers supplemented with EXSB gained the highest and had better apparent feed efficiency. Apparent feed efficiency was similar to those observed in protein supplementation, suggesting that some increase in DM intake from pasture may have occurred. RSB had the poorest apparent feed efficiency which agreed with the numerical lower OM intake observed in experiment 1. All supplemented heifers had higher gain, hip height change, thoracic perimeter and body condition score change than the control group
- …